Malign Distributions for Average Case Circuit Complexity
نویسندگان
چکیده
منابع مشابه
Malign Distributions for Average Case Circuit Complexity
In contrast to machine models like Turing machines or random access machines, circuits are a static computational model. The internal information ow of a computation is xed in advance, independent of the actual input. Therefore, the size and the depth are natural and simple measures for circuits and provide a worst case measure. We consider a model where an internal gate can be evaluated when t...
متن کاملMedizinische Universitt at L Ubeck 1 Malign Distributions for Average Case Circuit Complexity
In contrast to machine models like Turing machines or random access machines, circuits are a rigid computational model. The internal information ow of a computation is xed in advance, independent of the actual input. Therefore, in complexity theory only worst case complexity measures have been used to analyse this model. In JRS 94] we have deened an average case measure for the time complexity ...
متن کاملComplexity of Distributions and Average-Case Hardness
We address a natural question in average-case complexity: does there exist a language L such that for all easy distributions D the distributional problem (L,D) is easy on the average while there exists some more hard distribution D′ such that (L,D′) is hard on the average? We consider two complexity measures of distributions: complexity of sampling and complexity of computing the distribution f...
متن کاملAverage Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملInteractive Communication: Balanced Distributions, Correlated Files, and Average-Case Complexity
( X , Y ) is a pair of random variables distributed over a support set S. Person PX knows X , Person P y knows Y , and both know S. Using a predetermined protocol, they exchange binary messages in order for Py to learn X . Px may or may not learn Y . The m-message complexity, C,, is the number of information bits that must be transmitted (by both persons) in the worst case if only m messages ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1999
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2776